Direction-Aware Nearest Neighbor Query

Location Privacy-Aware Nearest-Neighbor Query with Complex Cloaked Regions

The development of location-based services has spread over many aspects of modern social life. This development brings not only conveniences to users’ daily life but also great concerns about users’ location privacy. In such services, location privacy aware query processing that handles cloaked regions is becoming an essential part in preserving user privacy. However, the state-of-the-art cloak...

Query-Aware Locality-Sensitive Hashing for Approximate Nearest Neighbor Search

Locality-Sensitive Hashing (LSH) and its variants are the well-known indexing schemes for the c-Approximate Nearest Neighbor (c-ANN) search problem in high-dimensional Euclidean space. Traditionally, LSH functions are constructed in a query-oblivious manner in the sense that buckets are partitioned before any query arrives. However, objects closer to a query may be partitioned into different bu...

Query Point Nearest Neighbor

We explore the eeect of dimensionality on the \nearest neigh-bor" problem. We show that under a broad set of conditions (much broader than independent and identically distributed dimensions), as di-mensionality increases, the distance to the nearest data point approaches the distance to the farthest data point. To provide a practical perspective , we present empirical results on both real and s...

Context-Aware Nearest Neighbor Query on Social Networks

Credible Nearest Neighbor Query in Uncertain Network

K-nearest-neighbor query is an important query in uncertain network, which is finding the k close nodes to a specific node. We first put forward the concept of the credible nearest neighbor query in uncertain network, and give credible k-nearest-neighbor query algorithm. Credible distance is used to describe the distance between nodes in uncertain network. Fuzzy simulation is adopted to decreas...